Sen - R 9708 1997
نویسندگان
چکیده
We study equational axiomatizations of bisimulation equivalence for the language obtained by extending Milner's basic CCS with string iteration. String iteration is a variation on the original binary version of the Kleene star operation p q obtained by restricting the rst argument to be a non-empty sequence of atomic actions. We show that, for every positive integer k, bisimulation equivalence over the set of processes in this language with loops of length at most k is nitely axiomatizable, provided that the set of actions is nite. We also ooer an innnite equational theory that completely axiomatizes bisimulation equivalence over the whole language. We prove that this result cannot be improved upon by showing that no nite equational axiomatization of bisimulation equivalence over basic CCS with string iteration can exist, unless the set of actions is empty. carried out during a visit of the second author to Aalborg University.
منابع مشابه
Pna - R 9708 1997
This paper presents a comprehensive discussion on connected morphological operators for binary images. Introducing a connectivity on the underlying space, every image induces a partition of the space in foreground and background components. A connected operator is an operator that coarsens this partition for every input image. A connected operator is called a grain operator if it has the follow...
متن کاملLearning Situation - Specific Control in Multi - Agent Systems
LEARNING SITUATION-SPECIFIC CONTROL IN MULTI-AGENT SYSTEMS
متن کاملTowards a social level characterisation of socially responsible agents
This paper presents a high-level framework for analysing and designing intelligent agents. The framework’s key abstraction mechanism is a new computer level called the Social Level. The Social Level sits immediately above the Knowledge Level, as defined by Allen Newell, and is concerned with the inherently social aspects of multiple agent systems. To illustrate the working of this framework, an...
متن کاملSen - R 9709 1997
We deene a speciication language called`timed CRL'. This language is designed to describe communicating processes employing data and time. Timed CRL is the successor of CRL 17]. It diiers in two main aspects. It is possible to make explicit reference to time using a newàt' operator; p,t is the process p where the rst action must take place at time t. Furthermore, a distinction has been made bet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997